Non-Homogeneous Fractal Hierarchical Weighted Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Homogeneous Fractal Hierarchical Weighted Networks

A model of fractal hierarchical structures that share the property of non-homogeneous weighted networks is introduced. These networks can be completely and analytically characterized in terms of the involved parameters, i.e., the size of the original graph Nk and the non-homogeneous weight scaling factors r1, r2, · · · rM. We also study the average weighted shortest path (AWSP), the average deg...

متن کامل

Ifs Coding of High Order Non-homogeneous Fractal Images

This paper proposes a moment based encoding algorithm for iterated function system (IFS) coding of high order nonhomogeneous fractal images. The proposed algorithm employs a quasi-Newton method combined with a multi-start steepest descent technique in order to solve the simultaneous algebraic equations for IFS codes. Experimental results show that the average computational time for encoding the...

متن کامل

Hierarchical Bayesian models in ecology: Reconstructing species interaction networks from non-homogeneous species abundance data

The relationships among organisms and their surroundings can be of immense complexity. To describe and understand an ecosystem as a tangled bank, multiple ways of interaction and their effects have to be considered, such as predation, competition, mutualism and facilitation. Understanding the resulting interaction networks is a challenge in changing environments, e.g. to predict knock-on effect...

متن کامل

Box-covering algorithm for fractal dimension of weighted networks.

Box-covering algorithm is a widely used method to measure the fractal dimension of complex networks. Existing researches mainly deal with the fractal dimension of unweighted networks. Here, the classical box covering algorithm is modified to deal with the fractal dimension of weighted networks. Box size length is obtained by accumulating the distance between two nodes connected directly and gra...

متن کامل

Traffic Driven Epidemic Spreading in Weighted Homogeneous Networks

To investigate the impact of weights on the traffic driven epidemic spreading in weighted homogeneous networks, an epidemic model in pseudo-random network with adjustable weights is presented. In the scenario that epidemic pathway is defined and driven by traffic flows, the epidemic spreading velocity of SI model in weighted homogeneous networks is obviously accelerated when the edge weight is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLOS ONE

سال: 2015

ISSN: 1932-6203

DOI: 10.1371/journal.pone.0121946